Kinematic Orienteering Problem With Time-Optimal Trajectories for Multirotor UAVs
نویسندگان
چکیده
In many unmanned aerial vehicle (UAV) applications for surveillance and data collection, it is not possible to reach all requested locations due the given maximum flight time. Hence, must be prioritized problem of selecting most important modeled as an Orienteering Problem (OP). To fully exploit kinematic properties UAV in such scenarios, we combine OP with generation time-optimal trajectories bounds on velocity acceleration. We define resulting Kinematic (KOP) propose exact mixed-integer formulation together a Large Neighborhood Search (LNS) heuristic solution method. demonstrate effectiveness our approach based orienteering instances from literature benchmark against optimal solutions Dubins (DOP) state-of-the-art. Additionally, show by simulation that can tracked precisely modern MPC-based controller. Since state-of-the-art generating multiple dimensions generally correct, further present improved analytical method trajectory generation.
منابع مشابه
Optimal trajectories for kinematic planar rigid bodies with switching costs
The optimal trajectory with respect to some metric for a system with a discrete set of controls may require very many switches between controls, or even infinitely many, a phenomenon called chattering; this can be problematic for existing motion planning algorithms that plan using a finite set of motion primitives. One remedy is to add some penalty for switching between controls. This paper exp...
متن کاملThe Team Orienteering Problem with Capacity Constraint and Time Window
The Team Orienteering Problem (TOP) is defined as to find a set of vehicle walks such that the total collected reward received from visiting a subset of customers is maximized and the length of each vehicle walk is restricted by a pre-specified limit. The team orienteering problem with capacity constraint and time window(TOPCT) is an extension of the TOP where each customer has a demand and a t...
متن کاملSolving multi-objective team orienteering problem with time windows using adjustment iterated local search
One of the problems tourism faces is how to make itineraries more effective and efficient. This research has solved the routing problem with the objective of maximizing the score and minimizing the time needed for the tourist’s itinerary. Maximizing the score means collecting a maximum of various kinds of score from each destination that is visited. The profits differ according to whether those...
متن کاملThe Multiconstraint Team Orienteering Problem with Multiple Time Windows
The Orienteering Problem (OP) is a combinatorial routing problem of which the goal is to find a tour that maximises the total score earned by visiting vertices. A set of vertices is given, determined by their coordinates and a score. The pairwise travel times between the vertices are known. The total travel time should not exceed a predetermined time budget. Each vertex can be visited at most o...
متن کاملAtmospheric Sampling on Ascension Island Using Multirotor UAVs
As part of an NERC-funded project investigating the southern methane anomaly, a team drawn from the Universities of Bristol, Birmingham and Royal Holloway flew small unmanned multirotors from Ascension Island for the purposes of atmospheric sampling. The objective of these flights was to collect air samples from below, within and above a persistent atmospheric feature, the Trade Wind Inversion,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE robotics and automation letters
سال: 2022
ISSN: ['2377-3766']
DOI: https://doi.org/10.1109/lra.2022.3194688